Semi-infinite programming, duality, discretization and optimality conditions†
نویسندگان
چکیده
منابع مشابه
Semi-infinite programming, duality, discretization and optimality conditions
The aim of this paper is to give a survey of some basic theory of semi-infinite programming. In particular, we discuss various approaches to derivations of duality, discretization, and first and second order optimality conditions. Some of the surveyed results are well known while others seem to be less noticed in that area of research.
متن کاملINVITED REVIEW Semi-infinite programming, duality, discretization and optimality conditionsy
Here is a (possibly infinite) index set, R 1⁄4 R [ fþ1g [ f 1g denotes the extended real line, f : R ! R and g : R !R. The above optimization problem is performed in the finite-dimensional space R and, if the index set is infinite, is a subject to an infinite number of constraints, therefore it is referred to as a SIP problem. There are numerous applications which lead to SIP problems. We can r...
متن کاملOptimality and Duality for Minimax Fractional Semi-Infinite Programming
The purpose of this paper is to consider a class of nonsmooth minimax fractional semi-infinite programming problem. Based on the concept of H − tangent derivative, a new generalization of convexity, namely generalized uniform ( , ) H B ρ − invexity, is defined for this problem. For such semi-infinite programming problem, several sufficient optimality conditions are established and proved by uti...
متن کاملNecessary Optimality and Duality for Multiobjective Semi-infinite Programming
The aim of this paper is to deal with a class of multiobjective semi-infinite programming problem. For such problem, several necessary optimality conditions are established and proved using the powerful tool of K − subdifferential and the generalized convexity namely generalized uniform ( , , , ) K F d α ρ − − convexity. We also formulate the Wolf type dual models for the semi-infinite programm...
متن کاملFirst order optimality conditions for generalized semi-infinite programming problems
In this paper we study first order optimality conditions for the class of generalized semi-infinite programming problems (GSIPs). We extend various wellknown constraint qualifications for finite programming problems to GSIPs and analyze the extent to which a corresponding Karush-Kuhn-Tucker (KKT) condition depends on these extensions. It is shown that in general the KKT condition for GSIPs take...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization
سال: 2009
ISSN: 0233-1934,1029-4945
DOI: 10.1080/02331930902730070